Blume–Emery–Griffiths model on random graphs

نویسندگان

چکیده

The Blume-Emery-Griffiths model with a random crystal field is studied in graph architecture, which the average connectivity controllable parameter. disordered over realizations treated by replica symmetry formalism of order parameter functions. A self-consistent equation for distribution local fields derived and numerically solved population dynamics algorithm. results show that amounts to changes topology phase diagrams. Phase diagrams representative values parameters are compared those obtained fully connected mean renormalization group approaches.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Majority Model on Random Regular Graphs

Consider a graph G = (V, E) and an initial random coloring where each vertex v ∈ V is blue with probability Pb and red otherwise, independently from all other vertices. In each round, all vertices simultaneously switch their color to the most frequent color in their neighborhood and in case of a tie, a vertex keeps its current color. The main goal of the present paper is to analyze the behavior...

متن کامل

Majority-vote model on random graphs.

The majority-vote model with noise on Erdös-Rényi's random graphs has been studied. Monte Carlo simulations were performed to characterize the order-disorder phase transition appearing in the system. We found that the value of the critical noise parameter qc is an increasing function of the mean connectivity z of the random graph. The critical exponents beta/nu, gamma/nu, and 1/nu were calculat...

متن کامل

On the Model Theory of Random Graphs

Title of dissertation: ON THE MODEL THEORY OF RANDOM GRAPHS Justin Brody, Doctor of Philosophy, 2009 Dissertation directed by: Professor Michael C. Laskowski Department of Mathematics Hrushovski’s amalgamation construction can be used to join a collection of finite graphs to produce a “generic” of this collection. The choice of the collection and the way they are joined are determined by a real...

متن کامل

Random Multi-Hopper Model. Super-Fast Random Walks on Graphs

We develop a model for a random walker with long-range hops on general graphs. This random multi-hopper jumps from a node to any other node in the graph with a probability that decays as a function of the shortest-path distance between the two nodes. We consider here two decaying functions in the form of the Laplace and Mellin transforms of the shortest-path distances. Remarkably, when the para...

متن کامل

Random Walks on Random Graphs

The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physica D: Nonlinear Phenomena

سال: 2023

ISSN: ['1872-8022', '0167-2789']

DOI: https://doi.org/10.1016/j.physa.2023.128522